
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1646. -- [Usaco2007 Open]Catch That Cow -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1646: [Usaco2007 Open]Catch That Cow</h2><span class=green>Time Limit: </span>5 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>286&nbsp;&nbsp;<span class=green>Solved: </span>138<br>[<a href='submitpage.php?id=1646'>Submit</a>][<a href='problemstatus.php?id=1646'>Status</a>][<a href='bbs.php?id=1646'>Discuss</a>]</center><h2>Description</h2><div class=content>Farmer John has been informed of the location of a fugitive cow and
wants to catch her immediately. He starts at a point N (0 <= N <=
100,000) on a number line and the cow is at a point K (0 <= K <=
100,000) on the same number line. Farmer John has two modes of
transportation: walking and teleporting.

    * Walking: FJ can move from any point X to the points X-1 or
      X+1 in a single minute

    * Teleporting: FJ can move from any point X to the point 2*X
      in a single minute.

If the cow, unaware of its pursuit, does not move at all, how long
does it take for Farmer John to retrieve it?

从N点到K点,每次可以有两种选择
1:从X点到X-1或者X+1
2:从X点到2*X点.
问走多少点可以从N到K.</div><h2>Input</h2><div class=content>* Line 1: Two space-separated integers: N and K

</div><h2>Output</h2><div class=content>* Line 1: The least amount of time, in minutes, it takes for Farmer
        John to catch the fugitive cow.

</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>5 17<br />
Farmer John starts at point 5 and the fugitive cow is at point 17.<br />
<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>4<br />
<br />
OUTPUT DETAILS:<br />
<br />
The fastest way for Farmer John to reach the fugitive cow is to<br />
move along the following path: 5-10-9-18-17, which takes 4 minutes.</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Silver'>Silver</a></p></div><center>[<a href='submitpage.php?id=1646'>Submit</a>][<a href='problemstatus.php?id=1646'>Status</a>][<a href='bbs.php?id=1646'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
